Algorithm 2. VNS pseudocode.

Considering a randomly generated initial candidate solution s:

begin VNS while(limit number of iterations not reached) do k ← 1;

   while (k ≤ L) do s' ← randomly generate a neighbor s'Î N_k(s)

s'' ← perform the one-bit local search for s';

      if f(s'') > f(s) then s ←s''

k ← 1

      else k ←k +1

      end if

   end while end while returns end VNS